%0 Conference Proceedings
%4 dpi.inpe.br/ambro/1998/05.14.11.04
%2 sid.inpe.br/banon/2001/03.30.15.56.35
%T An efficient filling algorithm for non-simple closed curves using the point containment paradigm
%D 1997
%A Fabris, Antonio Elias,
%A Silva, Luciano,
%A Forrest, A. Robin,
%E Figueiredo, Luiz Henrique de,
%E Netto, Marcio Lobo,
%B Brazilian Symposium on Computer Graphics and Image Processing, 10 (SIBGRAPI)
%C Campos de Jordão, SP, Brazil
%8 Oct. 1997
%I IEEE Computer Society
%J Los Alamitos
%P 2-9
%S Proceedings
%1 SBC - Sociedade Brasileira de Computação; USP - Universidade de São Paulo
%X The Point Containment predicate which specifies if a point is part of a mathematically defined shape or not is one of the most basic notions in raster graphics. This paper presents a technique to counteract the main disadvantage of Point Containment algorithms: their quadratic time complexity with increasing resolution. The implementented algorithm handles complex geometries such as self-intersecting closed curves.
%@language en
%3 art17.pdf
%O The conference was held in Campos de Jordão, SP, Brazil, from October 13 to 16.